CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
نویسندگان
چکیده
منابع مشابه
Analyse Power Consumption by Mobile Applications Using Fuzzy Clustering Approach
With the advancements in mobile technology and its utilization in every facet of life, mobile popularity has enhanced exponentially. The biggest constraint in the utility of mobile devices is that they are powered with batteries. Optimizing mobile’s size and weight is always the choice of designer, which led limited size and capacity of battery used in mobile phone. In this paper analysis of th...
متن کاملFuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem
This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملCluster Utility: A new metric to guide sequence clustering algorithms
Motivation: Automatic sequence clustering has become very important in analyzing the ever increasing number of biological sequences. Unresolved issues in sequence clustering include limiting generation of incorrect and fragmented clusters, and handling different levels of cluster specificity. Graph theoretical approaches are often used in clustering problem. Sequences are represented as nodes a...
متن کاملThe Reverse Greedy Algorithm for the Metric K-Median Problem
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the total distance to the remaining facilities. It stops when k facilities remain. We prove that, if the distance function is metric, then the approximation ratio of RGREEDY is between (logn/ log logn) and O(logn). 2005...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 2000
ISSN: 0286-522X
DOI: 10.5109/13491